Quay crane scheduling with non-interference constraints in port container terminals
نویسندگان
چکیده
The quay crane scheduling problem studied in this paper is to determine a handling sequence of holds for quay cranes assigned to a container vessel considering interference between quay cranes. This paper provides a mixed integer programming model for the considered quay crane scheduling problem that is NP-complete in nature. A genetic algorithm is proposed to obtain near optimal solutions. Computational experiments are conducted to examine the proposed model and solution algorithm. The computational results show that the proposed genetic algorithm is effective and efficient in solving the considered quay crane scheduling problem. 2006 Elsevier Ltd. All rights reserved.
منابع مشابه
An Approximation Algorithm for Quay Crane Scheduling with Non- interference Constraints in Port Container Terminals
Nowadays competition between port container terminals, especially between geographically close ones, is rapidly increasing. How to improve the competitiveness of port container terminals is, therefore, an immediate challenge, with which port operators are confronted. In terms of port competitiveness, the makespan of a container vessel, which is the latest completion time among all handling task...
متن کاملYard crane scheduling in port container terminals using genetic algorithm
Yard crane is an important resource in container terminals. Efficient utilization of the yard crane significantly improves the productivity and the profitability of the container terminal. This paper presents a mixed integer programming model for the yard crane scheduling problem with non- interference constraint that is NPHARD in nature. In other words, one of the most important constraints in...
متن کاملQuay Cranes and Yard Trucks Scheduling Problem at Container Terminals
A bi-objective mathematical model is developed to simultaneously consider the quay crane and yard truck scheduling problems at container terminals. Main real-world assumptions, such as quay cranes with non-crossing constraints, quay cranes’ safety margins and precedence constraints are considered in this model. This integrated approach leads to better efficiency and productivity at container te...
متن کاملAddressing a Coordinated Quay Crane Scheduling and Assignment Problem by Red Deer Algorithm
Nowadays, there is much attention for planning of container terminals in the global trade centers. The high cost of quay cranes motivates both scholars and industrial practitioners especially in the last decade to develop novel optimization models to address this dilemma. This study proposes a coordinated optimization model to cover both Quay Crane Scheduling Problem (QCSP) and Quay Crane Assig...
متن کاملA Quay Crane Scheduling Model in Container Terminals
This paper discusses the problem of scheduling quay cranes, the most important equipment in port terminals. A simulation model is developed for evaluating time of quay cranes. Then a dynamic scheduling model using objective programming for quay cranes is developed based on genetic algorithm approach. Finally, numerical experiments on a specific container terminal are made for propose approach. ...
متن کامل